A note on Fouquet-Vanherpe’s question and Fulkerson conjecture
نویسنده
چکیده مقاله:
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe asked whether Petersen graph is the only one with that property. H"{a}gglund gave a negative answer to their question by constructing two graphs Blowup$(K_4, C)$ and Blowup$(Prism, C_4)$. Based on the first graph, Esperet et al. constructed infinite families of cyclically 4-edge-connected snarks with excessive index at least five. Based on these two graphs, we construct infinite families of cyclically 4-edge-connected snarks $E_{0,1,2,ldots, (k-1)}$ in which $E_{0,1,2}$ is Esperet et al.'s construction. In this note, we prove that $E_{0,1,2,3}$ has excessive index at least five, which gives a strongly negative answer to Fouquet and Vanherpe's question. As a subcase of Fulkerson conjecture, H"{a}ggkvist conjectured that every cubic hypohamiltonian graph has a Fulkerson-cover. Motivated by a related result due to Hou et al.'s, in this note we prove that Fulkerson conjecture holds on some families of bridgeless cubic graphs.
منابع مشابه
On Fulkerson conjecture
If G is a bridgeless cubic graph, Fulkerson conjectured that we can find 6 perfect matchings (a Fulkerson covering) with the property that every edge of G is contained in exactly two of them. A consequence of the Fulkerson conjecture would be that every bridgeless cubic graph has 3 perfect matchings with empty intersection (this problem is known as the Fan Raspaud Conjecture). A FR-triple is a ...
متن کاملA note on Berge-Fulkerson coloring
The Berge–Fulkerson Conjecture states that every cubic bridgeless graph has six perfect matchings such that every edge of the graph is contained in exactly two of these perfect matchings. In this paper, a useful technical lemma is proved that a cubic graph G admits a Berge–Fulkerson coloring if and only if the graph G contains a pair of edge-disjoint matchings M1 and M2 such that (i) M1 ∪ M2 in...
متن کاملFano colourings of cubic graphs and the Fulkerson Conjecture
A Fano colouring is a colouring of the edges of a cubic graph by points of the Fano plane such that the colours of any three mutually adjacent edges form a line of the Fano plane. It has recently been shown by Holroyd and Škoviera (J. Combin. Theory Ser. B, to appear) that a cubic graph has a Fano colouring if and only if it is bridgeless. In this paper we prove that six, and conjecture that fo...
متن کاملA Note on Mues’ Conjecture
We prove that Mues’ conjecture holds for the secondand higher-order derivatives of a square and higher power of any transcendental meromorphic function. 2000 Mathematics Subject Classification. 30D35.
متن کاملA note on Mahler’s conjecture
Let K be a convex body in Rn with Santaló point at 0. We show that if K has a point on the boundary with positive generalized Gauß curvature, then the volume product |K||K◦| is not minimal. This means that a body with minimal volume product has Gauß curvature equal to 0 almost everywhere and thus suggests strongly that a minimal body is a polytope.
متن کاملA note on Barnette's conjecture
Barnette conjectured that each planar, bipartite, cubic, and 3-connected graph is hamiltonian. We prove that this conjecture is equivalent to the statement that there is a constant c > 0 such that each graph G of this class contains a path on at least c|V (G)| vertices.
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 42 شماره 5
صفحات 1247- 1258
تاریخ انتشار 2016-10-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023